IoT-Applicable Generalized Frameproof Combinatorial Designs
نویسندگان
چکیده
Secret sharing schemes are widely used to protect data by breaking the secret into pieces and them amongst various members of a party. In this paper, our objective is produce repairable ramp scheme that allows for retrieval share through collection in event its loss. Repairable Threshold Schemes (RTSs) can be cloud storage General Data Protection Regulation (GDPR) protocols. Secure energy-efficient transfer sensor-based IoTs built using ramp-type schemes. Protecting personal privacy reinforcing security electronic identification (eID) cards achieved similar Desmedt et al. introduced concept frameproofness 2021, which motivated us further improve construction with respect framework. We introduce graph theoretic approach design well-rounded easy presentation idea clarity results. also highlight importance IoT applications, as they distribute several devices. offer superior lightweight compared symmetric key encryption or AE because do not disclose entire single device, but rather it among
منابع مشابه
Combinatorial properties of frameproof and traceability codes
In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can ooer protection by providing some form of traceability for pirated data. Several researchers have studied diierent notions of traceability and related concepts in recent years. \Strong" versions of traceability allow at least one member o...
متن کاملOn symmetric designs and binary 3-frameproof codes
In this paper, we study when the incidence matrix of a symmetric (v, k, λ)-BIBD is a 3-frameproof code. We show the existence of infinite families of symmetric BIBDs that are 3-frameproof codes, as well as infinite families of symmetric BIBDs that are not 3-frameproof codes.
متن کاملCombinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
In this paper we investigate combinatorial properties and constructions of two recent topics of cryptographic interest namely frameproof codes for digital ngerprinting and traceability schemes for broadcast encryption We rst give combinatorial descriptions of these two objects in terms of set systems and also discuss the Hamming distance of frameproof codes when viewed as error correcting codes...
متن کاملAn algorithm applicable to clearing combinatorial exchanges
It is important to approach negotiations in a way that ensures privacy. So far, research has focused on securely solving restricted classes of negotiation techniques, mainly the (M+1)-st-price auctions. Here we show how these results can be adapted to more general problems. This paper extends our previous results on how distributed finite discrete problems can be solved securely. Such problems ...
متن کاملMosaics of combinatorial designs
Abstract. Looking at incidence matrices of t (v, k, λ) designs as v×b matrices with 2 possible entries, each of which indicates incidences of a t -design, we introduce the notion of a c -mosaic of designs, having the same number of points and blocks, as a matrix with c different entries, such that each entry defines incidences of a design. In fact, a v×b matrix is decomposed in c incidence matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iot
سال: 2023
ISSN: ['2624-831X']
DOI: https://doi.org/10.3390/iot4030020